翻訳と辞書 Words near each other ・ Bilene ・ Bilene Airport ・ Bilene Macia District ・ Bilenke Council ・ Bilenke Pershe ・ Bilenke Rural Council, Zaporizhia Oblast ・ Bilenke, Zaporizhia Raion ・ Bilenky Cycle Works ・ Bilepton ・ Biles ・ Biles Island ・ Bilete de Papagal ・ Biletix ・ Biletići ・ Bileux ・ Bilevel optimization ・ Bilevel positive airway pressure ・ Bilevel rail car ・ Bilew ・ Biley ・ Bileća ・ Bileća Lake ・ Bilećanka ・ Bileńska Kolonia ・ Bilfinger ・ Bilfinger Berger Power Services ・ Bilfinger Deutsche Babcock Middle East ・ Bilga ・ Bilgabbari ・ Bilge Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Bilevel optimization ： ウィキペディア英語版 Bilevel optimization Bilevel optimization is a special kind of optimization where one problem is embedded (nested) within another. The outer optimization task is commonly referred to as the upper-level optimization task, and the inner optimization task is commonly referred to as the lower-level optimization task. These problems involve two kinds of variables, referred to as the upper-level variables and the lower-level variables. == Mathematical formulation of the problem == A general formulation of bilevel optimization problem can be written as follows: $\backslash min\backslash limits\_\backslash ;\backslash ;\; F(x,y)$ subject to: $G\_i(x,y)\; \backslash leq\; 0$, for $i\; \backslash in\; \backslash$; $y\; \backslash in\; \backslash arg\; \backslash min\; \backslash limits\_\; \backslash \; \backslash \}$ where :$F,f:\; R^\; \backslash times\; R^\; \backslash to\; R$ :$G\_i,g\_j:\; R^\; \backslash times\; R^\; \backslash to\; R$ :$X\; \backslash subseteq\; R^$ :$Y\; \backslash subseteq\; R^.$ In the above formulation, $F$ represents the upper-level objective function and $f$ represents the lower-level objective function. Similarly $x$ represents the upper-level decision vector and $y$ represents the lower-level decision vector. $G\_i$ and $g\_j$ represent the inequality constraint functions at the upper and lower levels respectively. If some objective function is to be maximized, it is equivalent to minimize its negative. The formulation above is also capable of representing equality constraints, as these can be easily rewritten in terms of inequality constraints: for instance, $h(x)=0$ can be translated as $\backslash$. However, it is usually worthwhile to treat equality constraints separately, to deal with them more efficiently in a dedicated way; in the representation above, they have been omitted for brevity. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Bilevel optimization」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.